Simulating non-prenex cuts in quantified propositional calculus
نویسندگان
چکیده
منابع مشابه
Simulating non-prenex cuts in quantified propositional calculus
We show that the quantified propositional proof systems Gi are polynomially equivalent to their restricted versions that require all cut formulas to be prenex Σqi (or prenex Πqi ). Previously this was known only for the treelike systems G ∗ i .
متن کاملExamining fragments of the quantified propositional calculus
When restricted to proving Σqi formulas, the quantified propositional proof system Gi is closely related to the Σ b i theorems of Buss’s theory S i 2. Namely, G ∗ i has polynomial-size proofs of the translations of theorems of S 2, and S i 2 proves that G ∗ i is sound. However, little is known about Gi when proving more complex formulas. In this paper, we prove a witnessing theorem for Gi simil...
متن کاملTree Grammars for the Elimination of Non-prenex Cuts
Recently a new connection between proof theory and formal language theory was introduced. It was shown that the operation of cut elimination for proofs with prenex Π1-cuts in classical first-order logic corresponds to computing the language of a particular type of tree grammars. The present paper extends this connection to arbitrary (i.e. non-prenex) cuts without quantifier alternations. The ke...
متن کاملQuantified Propositional Calculus and a Second-Order Theory for NC
Let H be a proof system for the quantified propositional calculus (QPC). We define the Σj -witnessing problem for H to be: given a prenex Σ q j -formula A, an H-proof of A, and a truth assignment to the free variables in A, find a witness for the outermost existential quantifiers in A. We point out that the Σ1 witnessing problems for the systems G 1 and G1 are complete for polynomial time and P...
متن کاملSimulation of Gi with prenex cuts
We show that the quantified propositional proof systems Gi are polynomially equivalent to their restricted versions that require all cut formulas to be prenex Σqi (or prenex Πqi ). Previously this was known only for the treelike systems G ∗ i .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Logic Quarterly
سال: 2011
ISSN: 0942-5616
DOI: 10.1002/malq.201020093